Cluster dynamics for randomly frustrated systems with finite connectivity.
نویسندگان
چکیده
منابع مشابه
Secure Communication in Shotgun Cellular Systems
In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...
متن کاملFragmentation transition in a coevolving network with link-state dynamics
We study a network model that couples the dynamics of link states with the evolution of the network topology. The state of each link, either A or B, is updated according to the majority rule or zero-temperature Glauber dynamics, in which links adopt the state of the majority of their neighboring links in the network. Additionally, a link that is in a local minority is rewired to a randomly chos...
متن کاملDesign of a Novel Framework to Control Nonlinear Affine Systems Based on Fast Terminal Sliding-Mode Controller
In this paper, a novel approach for finite-time stabilization of uncertain affine systems is proposed. In the proposed approach, a fast terminal sliding mode (FTSM) controller is designed, based on the input-output feedback linearization of the nonlinear system with considering its internal dynamics. One of the main advantages of the proposed approach is that only the outputs and external state...
متن کاملFrustrated chaos in biological networks.
The behaviour of three biologically inspired networks is investigated: Immune Idiotypic Network (IIN), Hopfield Network (HN) and Coupled Map Lattice (CML), mainly the effect on the dynamics induced by connecting the network in a frustrated way. Frustration occurs when the global structure is such that local connectivity patterns responsible for stable behaviour are intertwined, leading to mutua...
متن کاملOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
دوره 53 1 شماره
صفحات -
تاریخ انتشار 1996